A theorem on connected graphs in which every edge belongs to a 1-factor
نویسندگان
چکیده
منابع مشابه
Minimally (k, k-1)-edge-connected graphs
For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the...
متن کاملModules for which every non-cosingular submodule is a summand
A module $M$ is lifting if and only if $M$ is amply supplemented and every coclosed submodule of $M$ is a direct summand. In this paper, we are interested in a generalization of lifting modules by removing the condition"amply supplemented" and just focus on modules such that every non-cosingular submodule of them is a summand. We call these modules NS. We investigate some gen...
متن کاملA Chain Theorem for 3+-Connected Graphs
4 A 3-connected graph is 3-connected if it has no 3-separation that separates a “large” fan or K3,n 5 from the rest of the graph. It is proved in this paper that, except for K4, every 3 -connected graph has 6 a 3-connected proper minor that is at most two edges away from the original graph. This result is used 7 to characterize Q-minor-free graphs, where Q is obtained from the Cube by contracti...
متن کاملQuartic Graphs with Every Edge in a Triangle
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from the line multigraphs of cubic multigraphs by a number of simple subgraph-replacement operations. A corollary of this is that a simple quartic graph with every e...
متن کاملA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1974
ISSN: 0004-9735
DOI: 10.1017/s144678870002913x